Nonrecurrent traffic congestion detection with a coupled scalable Bayesian robust tensor factorization model
نویسندگان
چکیده
Nonrecurrent traffic congestion (NRTC) usually brings unexpected delays to commuters. Hence, it is critical accurately detect and recognize the NRTC in a real-time manner. The advancement of road detectors provides researchers with large-scale multivariable temporal-spatial data, which allows deep research on be conducted. However, remains challenging task construct an analytical framework through natural structural properties information can effectively represented exploited better understand NRTC. In this paper, we present novel training-free based coupled scalable Bayesian robust tensor factorization (Coupled SBRTF). couple variables including flow, speed, occupancy sharing same sparse structure. Moreover, naturally captures high-dimensional patterns data by factorization. With its entries revealing distribution magnitude NRTC, shared structure compasses sufficiently abundant about While low-rank part framework, expresses general expected conditions as auxiliary product. Experimental results real-world show that proposed method outperforms detection models principal component analysis (coupled BRPCA), rank sparsity decomposition (RSTD), standard normal deviates (SND). performs even when only weekdays are utilized, hence provide more precise estimations for daily
منابع مشابه
Scoup-SMT: Scalable Coupled Sparse Matrix-Tensor Factorization
How can we correlate neural activity in the human brain as it responds to words, with behavioral data expressed as answers to questions about these same words? In short, we want to find latent variables, that explain both the brain activity, as well as the behavioral responses. We show that this is an instance of the Coupled MatrixTensor Factorization (CMTF) problem. We propose SCOUP-SMT, a nov...
متن کاملA General Model for Robust Tensor Factorization with Unknown Noise
Because of the limitations of matrix factorization, such as losing spatial structure information, the concept of low-rank tensor factorization (LRTF) has been applied for the recovery of a low dimensional subspace from high dimensional visual data. The low-rank tensor recovery is generally achieved by minimizing the loss function between the observed data and the factorization representation. T...
متن کاملScalable Bayesian Non-negative Tensor Factorization for Massive Count Data
We present a Bayesian non-negative tensor factorization model for count-valued tensor data, and develop scalable inference algorithms (both batch and online) for dealing with massive tensors. Our generative model can handle overdispersed counts as well as infer the rank of the decomposition. Moreover, leveraging a reparameterization of the Poisson distribution as a multinomial facilitates conju...
متن کاملRobust Bayesian Tensor Factorization for Incomplete Multiway Data
We propose a generative model for robust tensor factorization in the presence of both missing data and outliers. The objective is to explicitly infer the underlying low-CP-rank tensor capturing the global information and a sparse tensor capturing the local information (also considered as outliers), thus providing the robust predictive distribution over missing entries. The lowCP-rank tensor is ...
متن کاملScalable Bayesian Matrix Factorization
Matrix factorization (MF) is the simplest and most well studied factor based model and has been applied successfully in several domains. One of the standard ways to solve MF is by finding maximum a posteriori estimate of the model parameters, which is equivalent to minimizing the regularized objective function. Stochastic gradient descent (SGD) is a common choice to minimize the regularized obj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2021
ISSN: ['0925-2312', '1872-8286']
DOI: https://doi.org/10.1016/j.neucom.2020.10.091